منابع مشابه
Dually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...
متن کاملRegularity on Abelian Varieties I
This is the first in a series of papers meant to introduce a notion of regularity on abelian varieties and more general irregular varieties. This notion, called Mukai regularity, is based on Mukai’s concept of Fourier transform, and in a very particular form (called Theta regularity) it parallels and strengthens the usual CastelnuovoMumford regularity with respect to polarizations on abelian va...
متن کاملImplementing componentwise Hastings algorithms
Markov chain Monte Carlo (MCMC) routines have revolutionized the application of Monte Carlo methods in statistical application and statistical computing methodology. The Hastings sampler, encompassing both the Gibbs and Metropolis samplers as special cases, is the most commonly applied MCMC algorithm. The performance of the Hastings sampler relies heavily on the choice of sweep strategy, that i...
متن کاملComponentwise Distance to Singularity
A perturbation matrix A = A is considered, where A 2 IR and 0 2 IR. The matrix A is singular i A contains a real singular matrix. A problem is to decide if A is singular or nonsingular, a NP-hard problem. The decision can be made by the computation of the componentwise distance to the nearest singular matrix de ned on the basis of the real spectral radius, and by the solution of 4 eigenvalue pr...
متن کاملQuasirandomness and Regularity: Lecture Notes I
The idea behind quasirandomness is that many random-like properties of combinatorial objects are equivalent, although they often do not appear to be so on first glance. We begin with the first class to which this notion was applied, and perhaps the most studied of combinatorial objects, graphs. It is easy to show that each of the following properties are true with probability 1 of a uniformly c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2015
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2014.04.017